Profinite techniques for probabilistic automata and the Markov Monoid algorithm
نویسندگان
چکیده
منابع مشابه
Profinite techniques for probabilistic automata and the Markov Monoid algorithm
We consider the value 1 problem for probabilistic automata over finite words. This problem is known to be undecidable. However, different algorithms have been proposed to partially solve it. The aim of this paper is to prove that one such algorithm, called the Markov Monoid algorithm, is optimal. To this end, we develop a profinite theory for probabilistic automata. This new framework gives a t...
متن کاملProfinite automata
Many sequences of p-adic integers project modulo p to p-automatic sequences for every α ≥ 0. Examples include algebraic sequences of integers, which satisfy this property for every prime p, and some cocycle sequences, which we show satisfy this property for a fixed p. For such a sequence, we construct a profinite automaton that projects modulo p to the automaton generating the projected sequenc...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولMonoid Kernels and Profinite Topologies on the Free Abelian Group
To each pseudovariety of abelian groups residually containing the integers, there is naturally associated a proonite topology on any nite rank free abelian group. We show in this paper that if the pseudovariety in question has a decidable membership problem, then one can eeectively compute membership in the closure of a subgroup and more generally, in the closure of a rational subset of such a ...
متن کاملCompositional Abstraction Techniques for Probabilistic Automata
We present aggressive abstraction techniques for probabilistic automata (PA), a state-based model involving discrete probabilistic and nondeterministic branching. Our abstractions yield abstract PA in which transitions are typed “possible” or “required”—as in modal transition systems—and have constraint functions as target. The key idea is to focus on identifying common combined-transitions fro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.04.006